p(a(x0), p(a(b(x1)), x2)) → p(a(b(a(x2))), p(a(a(x1)), x2))
↳ QTRS
↳ DependencyPairsProof
p(a(x0), p(a(b(x1)), x2)) → p(a(b(a(x2))), p(a(a(x1)), x2))
P(a(x0), p(a(b(x1)), x2)) → P(a(b(a(x2))), p(a(a(x1)), x2))
P(a(x0), p(a(b(x1)), x2)) → P(a(a(x1)), x2)
p(a(x0), p(a(b(x1)), x2)) → p(a(b(a(x2))), p(a(a(x1)), x2))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
P(a(x0), p(a(b(x1)), x2)) → P(a(b(a(x2))), p(a(a(x1)), x2))
P(a(x0), p(a(b(x1)), x2)) → P(a(a(x1)), x2)
p(a(x0), p(a(b(x1)), x2)) → p(a(b(a(x2))), p(a(a(x1)), x2))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
P(a(x0), p(a(b(x1)), x2)) → P(a(a(x1)), x2)
Used ordering: Polynomial interpretation [25,35]:
P(a(x0), p(a(b(x1)), x2)) → P(a(b(a(x2))), p(a(a(x1)), x2))
The value of delta used in the strict ordering is 1/2.
POL(P(x1, x2)) = (7/4)x_1 + (2)x_2
POL(a(x1)) = 0
POL(p(x1, x2)) = 1/4 + (3)x_2
POL(b(x1)) = 3/2
p(a(x0), p(a(b(x1)), x2)) → p(a(b(a(x2))), p(a(a(x1)), x2))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
P(a(x0), p(a(b(x1)), x2)) → P(a(b(a(x2))), p(a(a(x1)), x2))
p(a(x0), p(a(b(x1)), x2)) → p(a(b(a(x2))), p(a(a(x1)), x2))